Many Nodal Domains in Random Regular Graphs
نویسندگان
چکیده
Let G be a random d-regular graph on n vertices. We prove that for every constant $$\alpha > 0$$ , with high probability eigenvector of the adjacency matrix eigenvalue less than $$-2\sqrt{d-2}-\alpha $$ has $$\Omega (n/\textrm{polylog}(n))$$ nodal domains.
منابع مشابه
Eigenvectors of Random Graphs: Nodal Domains
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relatively little is known about the corresponding eigenvectors. Our main focus in this paper is on the nodal domains associated with the different eigenfunctions. In the analogous realm of Laplacians of Riemannian manifolds,...
متن کاملEigenvectors of Random Graphs : Delocalization and Nodal Domains
We study properties of the eigenvectors of adjacency matrices of G(n, p) random graphs, for p = ω(logn)/n. This connects to similar investigations for other random matrix models studied in physics and mathematics. Motivated by the recent paper of Dekel, Lee and Linial we study delocalization properties of eigenvectors and their connection to nodal domains. We show the following for an eigenvect...
متن کاملColouring Random Regular Graphs
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular graph asymptotically almost surely (a.a.s.) has chromatic number 4 and that the chromatic number of a random d-regular graph for other d between 5 and 10 inclusive is a.a.s. restricted to a range of two integer values...
متن کاملLearning Random Regular Graphs
The family of random regular graphs is a classic topic in the realms of graph theory, combinatorics and computer science. In this paper we study the problem of learning random regular graphs from random paths. A random regular graph is generated uniformly at random and in a standard label-guided graph exploration setting, the edges incident from a node in the graph have distinct local labels. T...
متن کاملRandom strongly regular graphs?
Strongly regular graphs lie on the cusp between highly structured and unstructured. For example, there is a unique strongly regular graph with parameters (36,10,4,2), but there are 32548 non-isomorphic graphs with parameters (36,15,6,6). (The first assertion is a special case of a theorem of Shrikhande, while the second is the result of a computer search by McKay and Spence.) In the light of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 2023
ISSN: ['0010-3616', '1432-0916']
DOI: https://doi.org/10.1007/s00220-023-04709-6